Cubic TSP - a 1.3-approximation
نویسندگان
چکیده
We prove that every simple bridgeless cubic graph with n ≥ 8 vertices has a travelling salesman tour of length at most 1.3 · n − 2, which can be constructed in polynomial time.
منابع مشابه
Graphic TSP in 2-connected cubic graphs
We prove that every simple 2-connected cubic n-vertex graph contains a spanning closed walk of length at most 9n/7 − 1, and that such a walk can be found in polynomial time. This yields a polynomial-time 9/7-approximation algorithm for the graphic TSP for 2-connected cubic graphs, which improves the previously known approximation factor of 1.3 for 2-connected cubic graphs. On the negative side,...
متن کاملGraphic TSP in Cubic Graphs
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which improves the previously best approximation factor of 1.3 for 2-connected cubic graphs and drops the requirement of 2-connectivity at the same time. To design our algorithm, we prove that every simple 2-connected cubic n-vertex graph contains a spanning closed walk of length at most 9n/7− 1, and ...
متن کاملApproximation hardness of graphic TSP on cubic graphs
We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest.
متن کاملAn improved upper bound for the TSP in cubic 3-edge-connected graphs
We consider the travelling salesman problem (TSP) problem on (the metric completion of) 3-edge-connected cubic graphs. These graphs are interesting because of the connection between their optimal solutions and the subtour elimination LP relaxation. Our main result is an approximation algorithm better than the 3/2-approximation algorithm for TSP in general. © 2004 Elsevier B.V. All rights reserved.
متن کاملAn Improved Upper Bound for TSP in Cubic 3-Connected Graphs
We consider the classical minimum Travelling Salesman Problem on the class of 3-edge-connected cubic graphs. More specifically we consider their (shortest path) metric completions. The well-known conjecture states that the subtour elimination LP relaxation on the min TSP yields a 4/3 approximation factor, yet the best known approximation factor is 3/2. The 3-edge-connected cubic graphs are inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1506.06369 شماره
صفحات -
تاریخ انتشار 2015